<html>
 <body>
  <a href="http://sudopedia.enjoysudoku.com/Almost_Locked_Candidates.html">Almost Locked Candidates</a>
  <p>
   Almost Locked Sets (ALS) are groups of N cells in a single house with N+1 candidates (e.g. 3 cells with 4 candidates).<br> 
   The two <b>cells {0} and {1}</b> are bivalue cells and therefore the simplest possible <a href="http://sudopedia.enjoysudoku.com/Almost_Locked_Set.html">Almost Locked Sets</a>.
  </p>
  <p>
   All the <b>candidates {2} and {3}</b> in <b>{5}</b> are either located in the <b>ALS cell {1}</b> or in the intersection of <b>{4}</b> with <b>{5}</b>.<br/>
   Therefore the ALS cell forms a <a href="http://sudopedia.enjoysudoku.com/Hidden_Pair.html">Hidden Pair</a> with one of the cells in the intersection 
   which consequently must contain one of the ALS candidates <b>{2} or {3}</b>.<br/>
   It follows that this very cell also forms a <a href="http://sudopedia.enjoysudoku.com/Hidden_Pair.html">Hidden Pair</a> with the second <b>ALS cell {0}</b>. 
   All other candidates for the <b>digits {2} and {3}</b> in <b>{4}</b> can therefore be removed.
  </p>
 </body>
</html>